convex polygon

An improved algorithm is proposed based on the polygon convex decomposition algorithm based on point visibility.

在参考基于顶点可见性的凹多边形凸分解算法的基础上，提出了改进的方法。

A method to decide whether a vertex on a plane is in a convex polygon or not is presented according to the sign of the third dimension element of cross product of two vectors;

引入利用向量叉积符号判定三角形的方向，进而判别平面上一点是否在凸多边形内的方法，简化了计算。

this paper presents algorithms for automatic establishment of the topology of convex polygon and right-angled polygon respectively by using the house characteristic points extracted through image matching based on the analysis of polygon topology.

在已有的利用影像匹配提取出的房屋特征点的基础上，通过对多边形的拓扑结构的分析，分别提出了自动建立凸多边形和直角多边形拓扑关系的算法。

They are as follow, an optimal algorithm for determining the convex hull of a finite planar point set, an algorithm for triangulation of planar point-set in O ( nlogn) time, the fast algorithm for Delaunay triangulation of simple polygon based on maximum triangle weights.

它们分别是求平面点集凸壳的格雷厄姆方法的一个改进算法，一种时间复杂度为O（nlogn）的平面点集三角剖分算法和简单多边形快速Delaunay三角剖分算法。

The major contents are summarized as follows: 1. An improved method of generating random convex aggregates in two-dimensional area is proposed with help of the area index and convex polygon criteria.

本文开展的具体工作如下：1.提出了一种以改进面积判别准则和凸多边形生长方式为基础的二维混凝土骨料随机生成算法。

Decomposing a simple polygon into convex cell is one of elementary problems of computational geometry.

摘要简单多边形凸单元剖分是计算几何的基本问题之一,剖分算法在许多领域均有较广泛的应用.

Convex polygon star pattern identification algorithm for celestial guidance

星光制导中的凸多边形星图识别算法

An area of broken, rocky ground Algorithm for smallest quadrangle encasing box of convex polygon

凸多边形最小面积四边形包围盒算法

the experiment results have proved that new algorithm, which can be used for general concave polygon and convex polygon, further improves the clipping efficiency and it has good stability at same time.

实验结果表明算法稳定可靠，可实现对任意凹凸多边形的裁剪，在多边形与窗口的各种相对位置均具有较高的运算效率。

Draws a single , convex polygon . Vertices 1 through N define this polygon.

画一个凸多边形. 顶点1到n定义一个多边形.

Concave polygons have to be divided into several convex polygons, and are convex polygon clipping algorithms.

解决了大多数算法将凹多边形裁剪分解为凸多边形处理存在计算时间长、难度大等问题.